Many-to-Many Routing on Trees via Matchings
نویسندگان
چکیده
In this paper we present an extensive study of many-to-many routing on trees under the matching routing model. Our study includes on-line and off-line algorithms. We present an asymptotically optimal on-line algorithm which routes k packets to their destination within d(k 1) + d f dist routing steps, where d is the degree of tree T on which the routing takes place and dist is the maximum distance any packet has to travel. We also present an off-line algorithm that solves the same problem within 2(k 1) + dist steps. The analysis of our algorithms is based on the establishment of a close relationship between the matching and the hot-potato routing models that allows us to apply tools which were previously used exclusively in the analysis of hot-potato routing.
منابع مشابه
Many-to-One Packed Routing via Matchings
In this paper we study the packet routing problem under the matching model proposed by Alon, Chung and Graham 1]. We extend the model to allow more than one packet per origin and destination node. We give tight bounds for the many-to-one routing number for complete graphs, complete bipartite graphs and linear arrays. We also present an eecient algorithm for many-to-one routing on an trees (and ...
متن کاملRouting and Sorting Via Matchings On Graphs
The paper is divided in to two parts. In the first part we present some new results for the routing via matching model introduced by Alon et al [5]. This model can be viewed as a communication scheme on a distributed network. The nodes in the network can communicate via matchings (a step), where a node exchanges data with its partner. Formally, given a connected graph G with vertices labeled fr...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملParametric Permutation Routing via Matchings
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a framework which makes the analysis simple and local.
متن کامل